POPL: G: Refinement Types for Incremental Computational Complexity
نویسنده
چکیده
With recent advances, programs can be compiled to efficiently respond to incremental input changes. However, there is no language-level support for reasoning about the time complexity of incremental updates. Motivated by this gap, we present CostIt, a higher-order functional language with a lightweight refinement type system for proving asymptotic bounds on incremental computation time. Type refinements specify which parts of inputs and outputs may change, as well as incremental computational complexity, a measure of time required to propagate changes to a program’s execution trace, given modified inputs. We prove our type system sound using a new step-indexed cost semantics for change propagation and demonstrate the precision and generality of our technique through examples.
منابع مشابه
A Hybrid Framework for Building an Efficient Incremental Intrusion Detection System
In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...
متن کاملRefinement Types for Incremental Computational Complexity
With recent advances, programs can be compiled to efficiently respond to incremental input changes. However, there is no language-level support for reasoning about the time complexity of incremental updates. Motivated by this gap, we present CostIt, a higher-order functional language with a lightweight refinement type system for proving asymptotic bounds on incremental computation time. Type re...
متن کاملRefinement Types for Incremental Computational Complexity (Technical Appendix)
– four new types: type variable X, universal type ∀X : K.τ , type operator abstraction λi :: S.τ and type operator application τ I. – A new kinding judgment Ψ; ∆ ` T :: K that assigns kinds to types – Typing judgment ∆; Φ; Γ ` e :κ τ changes to Ψ; ∆; Φ; Γ ` e :κ τ in which the context Ψ binds the type variables. – The subtyping judgment is changed as follows: Ψ; ∆; Φ |= τ1 v τ2 : K. – Semantics...
متن کاملDistributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology
Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...
متن کاملGrain Refinement Efficiency of Multi-Axial Incremental Forging and Shearing: A Crystal Plasticity Analysis
Severe plastic deformation is a technical method to produce functional material with special properties such as high strength and specific physical properties. Selection of an efficient severe plastic deformation for grain refinement is a challenging field of study and using a modeling technique to predict the refinement efficiency has gained a lot of attentions. A comparative study was carried...
متن کامل